Asymptotic approximation by polynomials in the L1 norm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Best one-sided approximation of polynomials under L1 norm

In this paper, we develop an analytic solution for the best one-sided approximation of polynomials under L1 norm, that is, we 0nd two polynomials with lower degree which bound the given polynomial such that the areas between the bounding polynomials and the given polynomial attain minimum. The key ingredient of our technique is a characterization for one-sided approximations based on orthogonal...

متن کامل

Some Notes on the Best One-sided Approximation of Polynomials under L1 Norm

In the paper we review some known results about the one-sided approximation of polynomials with lower-degree polynomials under L1 norm. Then based on these results, the approximation error is formulated. Some properties are also stated for the general cases. The approximation can be used in the degree reduction of interval polynomials and interval Bézier curves.

متن کامل

Asymptotic $L^4$ norm of polynomials derived from characters

Littlewood investigated polynomials with coefficients in {−1, 1} (Littlewood polynomials), to see how small their ratio of norms ||f ||4/||f ||2 on the unit circle can become as deg(f) → ∞. A small limit is equivalent to slow growth in the mean square autocorrelation of the associated binary sequences of coefficients of the polynomials. The autocorrelation problem for arrays and higher dimensio...

متن کامل

Practical low-rank matrix approximation under robust L1-norm

A great variety of computer vision tasks, such as rigid/nonrigid structure from motion and photometric stereo, can be unified into the problem of approximating a lowrank data matrix in the presence of missing data and outliers. To improve robustness, the L1-norm measurement has long been recommended. Unfortunately, existing methods usually fail to minimize the L1-based nonconvex objective funct...

متن کامل

On the approximation by {polynomials

As usual, p∗ is called a best approximation (b.a.) to f in (or, by elements of) IPγ,n. To give some examples, let X = Lp[0, 1] and set γ(t) = G(·, t), where G(s, t) is defined on [0, 1] × T . With G Green’s function for a k–th order ordinary linear initial value problem on (0, 1] and T = [0, 1), one has approximation by generalized splines. With G(s, t) = e and T = IR, one has approximation by ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1973

ISSN: 0021-9045

DOI: 10.1016/0021-9045(73)90002-6